complementary subset

См. также в других словарях:

• Schwartz-Zippel lemma and testing polynomial identities — Polynomial identity testing is the problem of determining whether a given multivariate polynomial is the0 polynomial or identically equal to 0. The input to the problem is an n variable polynomial over a fieldF. It can occur in the following… …   Wikipedia

• Maximum cut — A maximum cut. For a graph, a maximum cut is a cut whose size is at least the size of any other cut. The problem of finding a maximum cut in a graph is known as the max cut problem. The problem can be stated simply as follows. One wants a subset… …   Wikipedia

• Universal space — The term Universal space was established in Computer Science the mid 1960 s by John Holland. It refers to a singular system of representation or communication, as the spaces used in physics to study its various mechanics [Holland, Descriptions,… …   Wikipedia

• Intersection homology — In topology, a branch of mathematics, intersection homology is an analogue of singular homology especially well suited for the study of singular spaces, discovered by Mark Goresky and Robert MacPherson in the fall of 1974 and developed by them… …   Wikipedia

• Antimatroid — In mathematics, an antimatroid is a formal system that describes processes in which a set is built up by including elements one at a time, and in which an element, once available for inclusion, remains available until it is included. Antimatroids …   Wikipedia

• probability theory — Math., Statistics. the theory of analyzing and making statements concerning the probability of the occurrence of uncertain events. Cf. probability (def. 4). [1830 40] * * * Branch of mathematics that deals with analysis of random events.… …   Universalium

• Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… …   Wikipedia

• Duality (mathematics) — In mathematics, a duality, generally speaking, translates concepts, theorems or mathematical structures into other concepts, theorems or structures, in a one to one fashion, often (but not always) by means of an involution operation: if the dual… …   Wikipedia

• Totally bounded space — In topology and related branches of mathematics, a totally bounded space is a space that can be covered by finitely many subsets of any fixed size (where the meaning of size depends on the given context). The smaller the size fixed, the more… …   Wikipedia

• nucleic acid — /nooh klee ik, klay , nyooh /, Biochem. any of a group of long, linear macromolecules, either DNA or various types of RNA, that carry genetic information directing all cellular functions: composed of linked nucleotides. [1890 95; NUCLE(US) + IC;… …   Universalium

• co-NP — Unsolved problems in computer science Is NP = co NP ? In computational complexity theory, co NP is a complexity class. A problem is a member of co NP if and only if its complement is in the complexi …   Wikipedia